How Tarski defined the undefinable CEZARY CIE Ś LI Ń SKI
نویسنده
چکیده
Alfred Tarski, one of the greatest logicians of all time, was born as Alfred Tajtelbaum in 1901. He came from a Jewish family living in Warsaw. In 1918-24 he studied at the University of Warsaw, initially biology, and then mathematics. At this time Warsaw was becoming one of the world leading centers in the area of logic and mathematics. Tarski’s logic teachers were Jan Łukasiewicz and Stanisław Leśniewski, prominent members of the emerging Lvov-Warsaw school – a thriving community of researchers and students, which was to flourish in Poland until the beginning of World War II. 1 Tarski wrote his PhD dissertation “On the primitive term of logistic” under the supervision of Stanisław Leśniewski (the dissertation having to do with Prothotetics – a logical system devised by his supervisor). 2 In later years Leśniewski kept saying “All my PhD students are geniuses”. It was widely known however that Tarski was the only PhD student of Leśniewski. After completing the doctorate, Tarski became a docent at the University of Warsaw. He was at that time the youngest researcher working as a docent in Warsaw. Since his job was poorly paid, he also taught mathematics at a secondary school in Warsaw. In August 1939 Tarski left for the US to take part in the Unity of Science Congress in Harvard. The invitation to address the Congress probably saved his life – World War II broke out soon after his departure from Europe. He remained in America for the rest of his life, teaching in Harvard and Berkeley, where he created a prominent center of research in logic and foundations of mathematics. He died in Berkeley in 1983. 3
منابع مشابه
POSTER SESSION II THURSDAY , MAY 31 th , 2012 CHAIRPERSONS : A . Malenovi ć and Ł . Cie ś la
متن کامل
Tarski Number and Configuration Equations
The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...
متن کاملJacek RUMI Ń SKI * CONTENT - BASED RETRIEVAL SYSTEM AS A TELEMEDICAL TOOL
The problem of medical teleconsultations with intelligent computer system rather than with a human expert is analyzed. System for content-based retrieval of images is described and presented as a use case of telemedical tool. Selected features, crucial for retrieval quality, are introduced including: synthesis of parametric images, regions of interest detection and extraction, definition of con...
متن کاملUnique Undefinable Elements
We present a structure (in a finite relational type) with a unique undefinable element. Furthermore, the unique undefinable element is undefinable even if we use the quantifier "there exist infinitely many" and quantitative variants. We show that the structures can be taken to be a graph. We also prove that "there is a structure (in a finite relational type) with a unique second order undefinab...
متن کامل